منابع مشابه
On the distance preserving trees in graphs
For a vertex v of a graph G, a spanning tree T of G is distancepreserving from v if, for any vertex w, the distance from v to w on T is the same as the distance from v to w on G. If two vertices u and v are distinct, then two distance-preserving spanning trees Tu from u and Tv from v are distinct in general. A purpose of this paper is to give a characterization for a given weighted graph G to h...
متن کاملOn Rectilinear Link Distance
Given a simple polygon P without holes all of whose edges are axis-parallel, a rectilinear path in P is a path that consists of axis-parallel segments only and does not cross any edge of P. The length of such a path is defined as the number of segments it consists of and the rectilinear link distance between two points in P is defined as the length of the shortest path connecting the two points...
متن کاملOn Distance Preserving and Sequentially Distance Preserving Graphs
A graph H is an isometric subgraph of G if dH(u, v) = dG(u, v), for every pair u, v ∈ V (H). A graph is distance preserving if it has an isometric subgraph of every possible order. A graph is sequentially distance preserving if its vertices can be ordered such that deleting the first i vertices results in an isometric subgraph, for all i ≥ 1. We give an equivalent condition to sequentially dist...
متن کاملTwo-level rectilinear Steiner trees
Given a set P of terminals in the plane and a partition of P into k subsets P1, . . . , Pk, a two-level rectilinear Steiner tree consists of a rectilinear Steiner tree Ti connecting the terminals in each set Pi (i = 1, . . . , k) and a top-level tree Ttop connecting the trees T1, . . . , Tk. The goal is to minimize the total length of all trees. This problem arises naturally in the design of lo...
متن کاملOn Min-Cost Rectilinear Steiner Distance-Preserving Tree Construction using a Generalized Min-Cost Flow on a Bipartite Network1
Given a signal net N = s; 1; ;n to be the set of nodes, with s the source and the remaining nodes sinks, an MRDPT (minimum-cost rectilinear Steiner distance-preserving tree) has the property that the length of every source to sink path is equal to the rectilinear distance between the source and sink. The minimum-cost rectilinear Steiner distance-preserving tree minimizes the total wire length w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: VLSI Design
سال: 1998
ISSN: 1065-514X,1563-5171
DOI: 10.1155/1998/26574